Term Rewriting: Some Experimental Results
نویسندگان
چکیده
We discuss tenn rewriting in conjunction with sprfn, a Prolog-based theorem prover. Two techniques for theorem proving that utilize tenn rewriting are presented. We demonstrate their effectiveness by exhibiting the results of our experiments in proving some theorems of von Neumann-Bemays-Godel set theory. Some outstanding problems associated with tenn rewriting are also addressed.
منابع مشابه
Some Experiments Using Term Rewriting Techniques for Concurrency
Theorem proving using term rewriting has been thoroughly explored for equational speciications; we look at the use of term rewriting for proving theorems in the process algebras of concurrency and conduct two experiments in this area. We use the LP theorem prover for proofs about CSP, and the RRL term rewriting system for reasoning about LOTOS. The results of these experiments provide informati...
متن کاملPerpetuality and Strong Normalization in Orthogonal Term Rewriting Systems
We design a strategy that for any given term t in an Orthogonal Term Rewriting System (OTRS) constructs a longest reduction starting from t if t is strongly normalizable, and constructs an innnite reduction otherwise. For some classes of OTRSs the strategy is easily computable. We develop a method for nding the least upper bound of lengths of reductions starting from a strongly normalizable ter...
متن کاملRelative Undecidability in Term Rewriting Part 2: The Confluence Hierarchy
For a hierarchy of properties of term rewriting systems related to confluence we prove relative undecidability, i.e., for implications X ⇒ Y in the hierarchy the property X is undecidable for term rewriting systems satisfying Y . For some of the implications either X or ¬X is semi-decidable, for others neither X nor ¬X is semi-decidable. We prove most of these results for linear term rewrite sy...
متن کاملComputational Properties of Term Rewriting with Replacement Restrictions
\'Ve give a general formulation of the notion of replacement restriction, a concepl which induces a restricted rewrite relation on a term rewriting system. Being a very general concept, we imroduce and motivate properties which can be used to characterize some important families of replacement rest rictions. We show how to approximate the lattice of replacement restrictions by the fini te latti...
متن کاملPrimitive Rewriting
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Another natural candidate for proofs regarding term rewriting is Recursion Theory, a direction we promote in this contribution. We present some undecidability results for “primitive” term rewriting systems, which encode pri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 11 شماره
صفحات -
تاریخ انتشار 1988